Simulating layered queueing networks with passive resources

نویسنده

  • Greg Franks
چکیده

This paper describes an extension to Layered Queueing Networks (LQN), a form of an extended queueing network used to investigate performance problems, to model passive resources such as counting semaphores and buffers. Layered queueing networks can be constructed directly, or from UML design models which incorporate the MARTE profile, either directly or via the Core Scenario Model. Layered Queueing Networks scale well and can solve analytically systems with nested resource requests to active resources. However, passive resources cause problems which force the use of simulation. The layered queueing network simulator, lqsim, is also described here. Simulations are created by reading in an LQN model, constructing objects from pre-existing templates, then solving. The semaphore task extension was incorporated by modifying the existing template used to model multi-server tasks. Finally, the semaphore extension was used to solve a model of a building security system which has a pool of buffers to capture video images. The results here show that a lack of buffers is indeed a bottleneck, but other parts of the system ultimately limit the capacity of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Fair Queueing: A Low Complexity Packet Scheduler for Embedded Networks

Fair queueing is a well-studied problem in modern computer networks. There are two classes of queueing algorithms. One focuses on bounded delay and good fairness properties. The other focuses on the performance of the scheduling algorithm itself. However in embedded networks working under real time constraints, equally important is the deadline imposed by the application. Modern queueing algori...

متن کامل

Product-form results for two-station networks with shared resources

Queueing networks are studied with two stations: either in tandem or in parallel, and with a common service resource shared among the two stations. First, a necessary and sufficient criterion, called adjoint reversibility, is provided to decide whether the system possesses a product form or not. This criterion unifies both the parallel (a reversible) and the tandem (a non-reversible) system in ...

متن کامل

Template Driven Performance Modeling of Enterprise Java Beans

System designers find it difficult to obtain insight into the potential performance, and performance problems, of enterprise applications based on component technologies like Enterprise Java Beans (EJBs) or .NET. One problem is the presence of layered resources, which have complicated effects on bottlenecks. Layered queueing network (LQN) performance models are able to capture these effects, an...

متن کامل

Performance Analysis of Client-Server Systems with Aggressive Server Replies

Replies Greg Franks C. M. Woodside Department of Systems and Computer Engineering Carleton University Ottawa, Ontario, Canada, K1S 5B6 Abstract Client-Server systems generally use the sendreceive-reply messaging paradigm for inter-process communication. In the most general case, the server process can be structured to continue to execute after replying to the client. Analytic models for closed ...

متن کامل

Cycle Time Estimation for Simulating a Tandem Queueing Systems Using Aggregation Techniques

One approach to simulating a single-server tandem queuing system is to explicitly model each of the production stages. In this paper, we apply queueing theory, a recursive algorithm, and composite random number sampling to develop an equivalent aggregate representation consisting of only a single production stage. Preliminary test results indicate that the aggregation works well for estimating ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011